Lonesum decomposable matrices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weighted Lonesum Matrices and Their Generating Function

A lonesum matrix is a (0, 1)-matrix uniquely determined by its column and row sums, and the sum of its all entries is called the “weight” of it. The generating function of numbers of weighted lonesum matrices of each weight is given. A certain explicit formula for the number of weighted lonesum matrices is also proved.

متن کامل

r-Indecomposable and r-Nearly Decomposable Matrices

Let n, r be integers with 0 ≤ r ≤ n− 1. An n×n matrix A is called r-partly decomposable if it contains a k×l zero submatrix with k+l = n−r+1. A matrix which is not r-partly decomposable is called r-indecomposable (shortly, r-inde). Let Eij be the n × n matrix with a 1 in the (i, j) position and 0’s elsewhere. If A is r-indecomposable and, for each aij 6= 0, the matrix ∗Research supported by Nat...

متن کامل

Constructing vertex decomposable graphs

‎Recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎In this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎Then we use this construction to generalize the result due to Cook and Nagel‎.

متن کامل

On the Ambiguity of Reconstructing hv-Convex Binary Matrices with Decomposable Configurations

Reconstructing binary matrices from their row, column, diagonal, and antidiagonal sums (also called projections) plays a central role in discrete tomography. One of the main difficulties in this task is that in certain cases the projections do not uniquely determine the binary matrix. This can yield an extremely large number of (sometimes very different) solutions. This ambiguity can be reduced...

متن کامل

Information Geometry of Positive Measures and Positive-Definite Matrices: Decomposable Dually Flat Structure

Information geometry studies the dually flat structure of a manifold, highlighted by the generalized Pythagorean theorem. The present paper studies a class of Bregman divergences called the (ρ, τ)-divergence. A (ρ, τ)-divergence generates a dually flat structure in the manifold of positive measures, as well as in the manifold of positive-definite matrices. The class is composed of decomposable ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2018

ISSN: 0012-365X

DOI: 10.1016/j.disc.2017.09.002